Deep-submicron Rectilinear Steiner Tree Problem

This paper presents a fast polynomial approximation algorithm for constructing the Steiner tree of minimum total cost (the cost of the edge (i; j) equal to the rectilinear distance between these nodes) with diierent requirements on delays along each path to destination. The exibility of the proposed algorithm permits to drive the number of Steiner nodes in the solution without increasing the tree's cost. Simulation results shows the high eeciency of algorithm. Thus the constructed trees are near the optimal. With the help of node's weights vary, in more than 64% cases, the number of Steiner vertices was reduced without increasing of the total tree's cost. The costs of the best trees (between ones, yielded by our algorithm with diierent values of the node's weights) were decreased in average on 11.4% and the number of Steiner nodes { on 39.1% with respect to the trees constructed without node's weights.